首页> 外文OA文献 >Dimension Reduction with Non-degrading Generalization
【2h】

Dimension Reduction with Non-degrading Generalization

机译:具有非降级推广的降维方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

Visualizing high dimensional data by projecting them into two or threedimensional space is one of the most effective ways to intuitively understandthe data's underlying characteristics, for example their class neighborhoodstructure. While data visualization in low dimensional space can be efficientfor revealing the data's underlying characteristics, classifying a new samplein the reduced-dimensional space is not always beneficial because of the lossof information in expressing the data. It is possible to classify the data inthe high dimensional space, while visualizing them in the low dimensionalspace, but in this case, the visualization is often meaningless because itfails to illustrate the underlying characteristics that are crucial for theclassification process. In this paper, the performance-preserving property of the previously proposedRestricted Radial Basis Function Network in reducing the dimension of labeleddata is explained. Here, it is argued through empirical experiments that theinternal representation of the Restricted Radial Basis Function Network, whichduring the supervised learning process organizes a visualizable two dimensionalmap, does not only preserve the topographical structure of high dimensionaldata but also captures their class neighborhood structures that are importantfor classifying them. Hence, unlike many of the existing dimension reductionmethods, the Restricted Radial Basis Function Network offers two dimensionalvisualization that is strongly correlated with the classification process.
机译:通过将高维数据投影到二维或三维空间中来对其进行可视化是直观地了解数据的基本特征(例如其类邻域结构)的最有效方法之一。尽管低维空间中的数据可视化可以有效地揭示数据的基本特征,但由于在表达数据时会丢失信息,因此在降维空间中对新样本进行分类并不总是有益的。可以在高维空间中对数据进行分类,而在低维空间中对数据进行可视化,但是在这种情况下,可视化通常是没有意义的,因为它无法说明对于分类过程至关重要的基本特征。在本文中,解释了先前提出的受限径向基函数网络在减小标记数据维数方面的性能保持特性。在这里,通过经验实验认为,受限径向基函数网络的内部表示在有监督的学习过程中组织了可视化的二维地图,不仅保留了高维数据的地形结构,而且还捕获了对于重要数据的类邻域结构。对它们进行分类。因此,与许多现有的降维方法不同,受限径向基函数网络提供了与分类过程密切相关的二维可视化。

著录项

  • 作者

    Hartono, Pitoyo;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号